Sampling Effects on Algorithm Selection for Continuous Black-Box Optimization

نویسندگان

چکیده

In this paper, we investigate how systemic errors due to random sampling impact on automated algorithm selection for bound-constrained, single-objective, continuous black-box optimization. We construct a machine learning-based selector, which uses exploratory landscape analysis features as inputs. test the accuracy of recommendations experimentally using resampling techniques and hold-one-instance-out hold-one-problem-out validation methods. The results demonstrate that selector remains accurate even with noise, although not without trade-offs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Studies in Continuous Black-box Optimization

O ptimization is the research field that studies that studies the design of algorithms for finding the best solutions to problems we humans throw at them. While the whole domain is of important practical utility, the present thesis will focus on the subfield of continuous black-box optimization, presenting a collection of novel, state-of-the-art algorithms for solving problems in that class. Fi...

متن کامل

Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning

In this paper, we build upon previous work on designing informative and efficient Exploratory Landscape Analysis features for characterizing problems’ landscapes and show their effectiveness in automatically constructing algorithm selection models in continuous black-box optimization problems. Focussing on algorithm performance results of the COCO platform of several years, we construct a repre...

متن کامل

Restarted Local Search Algorithms for Continuous Black Box Optimization

Several local search algorithms for real-valued domains (axis parallel line search, Nelder-Mead simplex search, Rosenbrock's algorithm, quasi-Newton method, NEWUOA, and VXQR) are described and thoroughly compared in this article, embedding them in a multi-start method. Their comparison aims (1) to help the researchers from the evolutionary community to choose the right opponent for their algori...

متن کامل

Black-box Importance Sampling

Importance sampling is widely used in machine learning and statistics, but its power is limited by the restriction of using simple proposals for which the importance weights can be tractably calculated. We address this problem by studying black-box importance sampling methods that calculate importance weights for samples generated from any unknown proposal or black-box mechanism. Our method all...

متن کامل

A Recursive Random Search Algorithm for Black-box Optimization

This paper proposes a new heuristic search algorithm, Recursive Random Search(RRS), for blackbox optimization problems. Specifically, this algorithm is designed for the dynamical parameter optimization of network protocols which emphasizes on obtaining good solutions within a limited time frame rather than full optimization. The RRS algorithm is based on the initial high-efficiency property of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2021

ISSN: ['1999-4893']

DOI: https://doi.org/10.3390/a14010019